#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

struct Primes {
    static constexpr int N = 2e5 + 10;
    int primes[N], vis[N];
    int cnt, d[N], p[N];
    int n;

    void init() {
        n = N - 10;
        d[1] = 1;
        FOR(i, 2, n) {
            if (!vis[i]) {
                primes[cnt++] = i;
                d[i] = 2;
                p[i] = 1;
            }
            for (int j = 0; i * primes[j] <= n; j++) {
                vis[i * primes[j]] = 1;
                if (i % primes[j] == 0) {
                    p[i * primes[j]] = p[i] + 1;
                    d[i * primes[j]] = d[i] / (p[i] + 1) * (p[i * primes[j]] + 1);
                    break;
                }
                p[i * primes[j]] = 1;
                d[i * primes[j]] = d[i] * 2;
            }
        }
    }
} A;

void solve() {
    int n, q;
    cin >> n >> q;
    V<int> w(n + 1, 0);

    A.init();

    FOR(i, 1, n) cin >> w[i];

    V<V<int>> mp(210);
    FOR(i, 1, n) {
        mp[A.d[w[i]]].eb(i);
    }

    while (q--) {
        int l, r;
        cin >> l >> r;
        int ans = 0;
        FOR(j, 1, 200) {
            int del = upper_bound(ALL(mp[j]), r) - lower_bound(ALL(mp[j]), l);
            ans += (del - 1) * del / 2;
        }
        cout << ans << endl;
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}